Bounded Generation by semi-simple elements: quantitative results

Complex Systems Built by Simple Elements

There are a lot of systems, which behave complexly, around us. We cannot predict their behaviour. Unpredictability is almost a character of complexity but how can we tackle the phenomenon of it. The formal mathematical descriptions of them are more and more complex and only several times solvable. Is the making a system of non-linear equations the only way to handle and descript systems like th...

Feature Generation by Simple FLD

This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a field of pattern recognition or signal processing, the principal component analysis (PCA) is often used for data compression and feature extraction. Furthermore, iterative learning algorithms for obtaining eigenvectors ha...

Improving Semi-Quantitative Reasoning by Landmark Approximation

Many extensions to existing qualitative simulation packages allow combined use of available numeric and qualitative information . Some provide numeric integration across two qualitative states but none of them highlights numerically or semi-quantitatively the qualitatively predicted time points . Moreover, high accuracy at time points is only achieved by a fine level of granularity across the e...

Returning to semi-bounded sets

Semi-formal Bounded Model Checking

This paper presents a novel approach to bounded model checking. We replace the SAT solver by an extended simulator of the circuit being verified. Compared to SAT-solving algorithms, our approach sacrifices some generality in selecting splitting variables and in the kinds of learning possible. In exchange, our approach enables compiled simulation of the circuit being verified, while our simulato...